0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E %s %d THM 0.12/0.34 % Computer : n016.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1440 0.12/0.34 % WCLimit : 180 0.12/0.34 % DateTime : Thu Jul 4 05:48:39 EDT 2024 0.12/0.34 % CPUTime : 0.21/0.47 Running higher-order theorem proving 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.DTCLP76Kbz/E---3.1_24296.p 0.21/0.49 # Version: 3.2.0-ho 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.21/0.49 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting sh2lt with 720s (4) cores 0.21/0.49 # Starting new_ho_10_unif with 180s (1) cores 0.21/0.49 # Starting full_lambda_6 with 180s (1) cores 0.21/0.49 # Starting post_as_ho1 with 180s (1) cores 0.21/0.49 # Starting ehoh_best3_rw with 180s (1) cores 0.21/0.49 # sh2lt with pid 24383 completed with status 0 0.21/0.49 # Result found by sh2lt 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.21/0.49 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting sh2lt with 720s (4) cores 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.21/0.49 # Search class: HGHNF-FFSF21-SHHFFMBN 0.21/0.49 # Scheduled 6 strats onto 4 cores with 720 seconds (720 total) 0.21/0.49 # Starting pre_casc_2 with 260s (1) cores 0.21/0.49 # Starting sh2lt with 73s (1) cores 0.21/0.49 # Starting ho_unfolding_2 with 98s (1) cores 0.21/0.49 # Starting pre_casc_6 with 98s (1) cores 0.21/0.49 # pre_casc_6 with pid 24391 completed with status 0 0.21/0.49 # Result found by pre_casc_6 0.21/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.21/0.49 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.50 # Starting sh2lt with 720s (4) cores 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.21/0.50 # Search class: HGHNF-FFSF21-SHHFFMBN 0.21/0.50 # Scheduled 6 strats onto 4 cores with 720 seconds (720 total) 0.21/0.50 # Starting pre_casc_2 with 260s (1) cores 0.21/0.50 # Starting sh2lt with 73s (1) cores 0.21/0.50 # Starting ho_unfolding_2 with 98s (1) cores 0.21/0.50 # Starting pre_casc_6 with 98s (1) cores 0.21/0.50 # Preprocessing time : 0.001 s 0.21/0.50 0.21/0.50 # Proof found! 0.21/0.50 # SZS status Theorem 0.21/0.50 # SZS output start CNFRefutation 0.21/0.50 thf(decl_22, type, epred1_0: ($i > $o) > $i > $o). 0.21/0.50 thf(decl_23, type, esk1_2: ($i > $o) > ($i > $o) > $i). 0.21/0.50 thf(decl_24, type, esk2_0: $i). 0.21/0.50 thf(decl_25, type, esk3_1: ($i > $o) > $i). 0.21/0.50 thf(decl_26, type, epred2_0: $i > $o). 0.21/0.50 thf(decl_27, type, epred3_1: $i > $i > $o). 0.21/0.50 thf(decl_28, type, esk4_2: $i > ($i > $o) > $i). 0.21/0.50 thf(cTHM2A_ONE_pme, conjecture, ![X1:($i > $o) > $i > $o]:((![X2:$i]:(((X1 @ (^[X3:$i]:(?[X4:$i > $o]:(((X4 @ X3)&![X5:$i]:(((X4 @ X5)=>(X1 @ X4 @ X5))))))) @ X2)=>?[X4:$i > $o]:((![X3:$i]:(((X1 @ X4 @ X3)<=(X4 @ X3)))&(X4 @ X2)))))<=![X6:$i > $o, X7:$i > $o]:((![X3:$i]:(((X1 @ X6 @ X3)=>(X1 @ X7 @ X3)))<=![X3:$i]:(((X6 @ X3)=>(X7 @ X3))))))), file('/export/starexec/sandbox/tmp/tmp.DTCLP76Kbz/E---3.1_24296.p', cTHM2A_ONE_pme)). 0.21/0.50 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i > $o]:((![X6:$i > $o, X7:$i > $o]:((![X3:$i]:(((X6 @ X3)=>(X7 @ X3)))=>![X3:$i]:(((X1 @ X6 @ X3)=>(X1 @ X7 @ X3)))))=>![X2:$i]:(((X1 @ (^[Z0/* 5 */:$i]:(?[X4:$i > $o]:((X4 @ Z0&![X5:$i]:((X4 @ X5=>X1 @ X4 @ X5)))))) @ X2)=>?[X4:$i > $o]:((![X3:$i]:(((X4 @ X3)=>(X1 @ X4 @ X3)))&(X4 @ X2)))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM2A_ONE_pme])])])). 0.21/0.50 thf(c_0_2, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X20:$i, X22:$i > $o]:(((((X17 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20)))&(~(X18 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20))))&((epred1_0 @ (^[Z0/* 5 */:$i]:(?[X4:$i > $o]:((X4 @ Z0&![X5:$i]:((X4 @ X5=>epred1_0 @ X4 @ X5)))))) @ esk2_0)&(((X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0))&(~(epred1_0 @ X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.21/0.50 thf(c_0_3, plain, ![X27:$i, X29:$i, X30:$i, X31:$i > $o]:(((((epred3_1 @ X27 @ X27)|~(epred2_0 @ X27))&(~(epred3_1 @ X27 @ X29)|(epred1_0 @ (epred3_1 @ X27) @ X29)|~(epred2_0 @ X27)))&(((X31 @ (esk4_2 @ X30 @ X31))|~(X31 @ X30)|(epred2_0 @ X30))&(~(epred1_0 @ X31 @ (esk4_2 @ X30 @ X31))|~(X31 @ X30)|(epred2_0 @ X30))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])])). 0.21/0.50 thf(c_0_4, plain, ![X26:$i]:(((epred2_0 @ X26)<=>?[X24:$i > $o]:(((X24 @ X26)&![X25:$i]:(((X24 @ X25)=>(epred1_0 @ X24 @ X25))))))), introduced(definition)). 0.21/0.50 thf(c_0_5, negated_conjecture, ![X4:$i > $o]:((~((epred1_0 @ X4 @ (esk3_1 @ X4)))|~((X4 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_6, plain, ![X3:$i, X2:$i]:(((epred1_0 @ (epred3_1 @ X2) @ X3)|~((epred3_1 @ X2 @ X3))|~((epred2_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.21/0.50 thf(c_0_7, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk3_1 @ X4))|~((X4 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_8, negated_conjecture, (((epred1_0 @ epred2_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_4])). 0.21/0.50 thf(c_0_9, plain, ![X2:$i]:((~((epred3_1 @ X2 @ esk2_0))|~((epred2_0 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])). 0.21/0.50 thf(c_0_10, plain, ![X2:$i]:(((epred3_1 @ X2 @ X2)|~((epred2_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.21/0.50 thf(c_0_11, plain, ![X4:$i > $o, X2:$i]:(((X4 @ (esk4_2 @ X2 @ X4))|(epred2_0 @ X2)|~((X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.21/0.50 thf(c_0_12, negated_conjecture, (epred1_0 @ epred2_0 @ esk2_0), inference(cn,[status(thm)],[c_0_8])). 0.21/0.50 thf(c_0_13, plain, ~((epred2_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.21/0.50 thf(c_0_14, negated_conjecture, ![X6:$i > $o, X4:$i > $o, X2:$i]:(((X4 @ (esk1_2 @ X4 @ X6))|(epred1_0 @ X6 @ X2)|~((epred1_0 @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_15, negated_conjecture, (epred1_0 @ epred2_0 @ (esk4_2 @ esk2_0 @ (epred1_0 @ epred2_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])). 0.21/0.50 thf(c_0_16, plain, ![X4:$i > $o, X3:$i, X2:$i]:(((epred3_1 @ X2 @ (esk1_2 @ (epred3_1 @ X2) @ X4))|(epred1_0 @ X4 @ X3)|~((epred3_1 @ X2 @ X3))|~((epred2_0 @ X2)))), inference(spm,[status(thm)],[c_0_14, c_0_6])). 0.21/0.50 thf(c_0_17, plain, ![X4:$i > $o, X2:$i]:(((epred2_0 @ X2)|~((epred1_0 @ X4 @ (esk4_2 @ X2 @ X4)))|~((X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.21/0.50 thf(c_0_18, negated_conjecture, ![X4:$i > $o]:(((epred1_0 @ X4 @ (esk4_2 @ esk2_0 @ (epred1_0 @ epred2_0)))|(epred2_0 @ (esk1_2 @ epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.21/0.50 thf(c_0_19, plain, ![X4:$i > $o, X2:$i]:(((epred3_1 @ X2 @ (esk1_2 @ (epred3_1 @ X2) @ X4))|(epred1_0 @ X4 @ X2)|~((epred2_0 @ X2)))), inference(spm,[status(thm)],[c_0_16, c_0_10])). 0.21/0.50 thf(c_0_20, plain, (epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_12])]), c_0_13])). 0.21/0.50 thf(c_0_21, plain, ![X2:$i, X3:$i]:(((epred2_0 @ X2)|~((epred3_1 @ X3 @ X2))|~((epred2_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_6]), c_0_11])). 0.21/0.50 thf(c_0_22, plain, ![X4:$i > $o]:(((epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0)) @ (esk1_2 @ (epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))) @ X4))|(epred1_0 @ X4 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.21/0.50 thf(c_0_23, negated_conjecture, ![X6:$i > $o, X4:$i > $o, X2:$i]:(((epred1_0 @ X4 @ X2)|~((X4 @ (esk1_2 @ X6 @ X4)))|~((epred1_0 @ X6 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.21/0.50 thf(c_0_24, plain, ![X4:$i > $o]:(((epred2_0 @ (esk1_2 @ (epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))) @ X4))|(epred1_0 @ X4 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_20])])). 0.21/0.50 thf(c_0_25, negated_conjecture, ![X2:$i]:(((epred1_0 @ epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0)))|(epred1_0 @ epred2_0 @ X2)|~((epred1_0 @ (epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))) @ X2)))), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.21/0.50 thf(c_0_26, negated_conjecture, ((epred1_0 @ epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0)))|~((epred1_0 @ (epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))) @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))))), inference(ef,[status(thm)],[c_0_25])). 0.21/0.50 thf(c_0_27, plain, ((epred1_0 @ epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0)))|~((epred3_1 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0)) @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_6]), c_0_20])])). 0.21/0.50 thf(c_0_28, plain, (epred1_0 @ epred2_0 @ (esk1_2 @ epred2_0 @ (epred1_0 @ epred2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_10]), c_0_20])])). 0.21/0.50 thf(c_0_29, negated_conjecture, ![X2:$i]:(((epred1_0 @ (epred1_0 @ epred2_0) @ X2)|~((epred1_0 @ epred2_0 @ X2)))), inference(spm,[status(thm)],[c_0_23, c_0_28])). 0.21/0.50 thf(c_0_30, negated_conjecture, ~((epred1_0 @ epred2_0 @ (esk3_1 @ (epred1_0 @ epred2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_29]), c_0_12])])). 0.21/0.50 thf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_7]), c_0_12])]), ['proof']). 0.21/0.50 # SZS output end CNFRefutation 0.21/0.50 # Parsed axioms : 1 0.21/0.50 # Removed by relevancy pruning/SinE : 0 0.21/0.50 # Initial clauses : 9 0.21/0.50 # Removed in clause preprocessing : 0 0.21/0.50 # Initial clauses in saturation : 9 0.21/0.50 # Processed clauses : 48 0.21/0.50 # ...of these trivial : 0 0.21/0.50 # ...subsumed : 6 0.21/0.50 # ...remaining for further processing : 42 0.21/0.50 # Other redundant clauses eliminated : 0 0.21/0.50 # Clauses deleted for lack of memory : 0 0.21/0.50 # Backward-subsumed : 2 0.21/0.50 # Backward-rewritten : 2 0.21/0.50 # Generated clauses : 111 0.21/0.50 # ...of the previous two non-redundant : 93 0.21/0.50 # ...aggressively subsumed : 0 0.21/0.50 # Contextual simplify-reflections : 2 0.21/0.50 # Paramodulations : 107 0.21/0.50 # Factorizations : 4 0.21/0.50 # NegExts : 0 0.21/0.50 # Equation resolutions : 0 0.21/0.50 # Disequality decompositions : 0 0.21/0.50 # Total rewrite steps : 26 0.21/0.50 # ...of those cached : 22 0.21/0.50 # Propositional unsat checks : 0 0.21/0.50 # Propositional check models : 0 0.21/0.50 # Propositional check unsatisfiable : 0 0.21/0.50 # Propositional clauses : 0 0.21/0.50 # Propositional clauses after purity: 0 0.21/0.50 # Propositional unsat core size : 0 0.21/0.50 # Propositional preprocessing time : 0.000 0.21/0.50 # Propositional encoding time : 0.000 0.21/0.50 # Propositional solver time : 0.000 0.21/0.50 # Success case prop preproc time : 0.000 0.21/0.50 # Success case prop encoding time : 0.000 0.21/0.50 # Success case prop solver time : 0.000 0.21/0.50 # Current number of processed clauses : 38 0.21/0.50 # Positive orientable unit clauses : 4 0.21/0.50 # Positive unorientable unit clauses: 0 0.21/0.50 # Negative unit clauses : 2 0.21/0.50 # Non-unit-clauses : 32 0.21/0.50 # Current number of unprocessed clauses: 54 0.21/0.50 # ...number of literals in the above : 193 0.21/0.50 # Current number of archived formulas : 0 0.21/0.50 # Current number of archived clauses : 4 0.21/0.50 # Clause-clause subsumption calls (NU) : 148 0.21/0.50 # Rec. Clause-clause subsumption calls : 105 0.21/0.50 # Non-unit clause-clause subsumptions : 7 0.21/0.50 # Unit Clause-clause subsumption calls : 13 0.21/0.50 # Rewrite failures with RHS unbound : 0 0.21/0.50 # BW rewrite match attempts : 1 0.21/0.50 # BW rewrite match successes : 1 0.21/0.50 # Condensation attempts : 48 0.21/0.50 # Condensation successes : 0 0.21/0.50 # Termbank termtop insertions : 3571 0.21/0.50 # Search garbage collected termcells : 407 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.002 s 0.21/0.50 # System time : 0.005 s 0.21/0.50 # Total time : 0.007 s 0.21/0.50 # Maximum resident set size: 1932 pages 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.015 s 0.21/0.50 # System time : 0.010 s 0.21/0.50 # Total time : 0.024 s 0.21/0.50 # Maximum resident set size: 1712 pages 0.21/0.50 % E---3.1 exiting 0.21/0.50 % E exiting 0.21/0.50 EOF